Materializing knowledge bases via trigger graphs

The chase is a well-established family of algorithms used to materialize Knowledge Bases (KBs) for tasks like query answering under dependencies or data cleaning. A general problem that they might perform redundant computations. To counter this problem, we introduce the notion Trigger Graphs (TGs), which guide execution rules avoiding We present results an extensive theoretical and empirical study seeks answer when how TGs can be computed what are benefits applied over real-world KBs. Our include introducing compute (minimal) TGs. implemented our approach in new engine, called GLog, experiments show it significantly more efficient than enabling us with 17B facts less 40 min using single machine commodity hardware.